منابع مشابه
Irreducibility properties of Keller maps
J ‘ edrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials. Furthermore, he showed that a polynomial map over a field of characteristic zero is a Keller map, if and only if the corresponding endomorphism maps irreducible polynomials to square-free polynomial...
متن کاملPower Linear Keller Maps of Dimension Three
In this paper it is proved that a power linear Keller map of dimension three over a field of characteristic zero is linearly triangularizable. Let K be a field. A polynomial map F in dimension n over K is an n-tuple (F1, F2, · · · , Fn) of polynomials in K[X1, X2, · · · , Xn]. If G is another polynomial map of the same dimension, then the composition of F and G is defined by F ◦G = (F1(G1, G2, ...
متن کاملA Mathematical Characterization for Patterns of a Keller-Segel Model with a Cubic Source Term
This paper deals with a Neumann boundary value problem for a Keller-Segel model with a cubic source term in a d-dimensional box (d = 1, 2, 3), which describes the movement of cells in response to the presence of a chemical signal substance. It is proved that, given any general perturbation of magnitude δ, its nonlinear evolution is dominated by the corresponding linear dynamics along a finite n...
متن کاملLaurent Keller
Laurent Keller is a professor at the University of Lausanne, where he directs the Department of Ecology and Evolution. After his PhD in Lausanne, he completed a postdoc with E.O. Wilson at Harvard and then returned to Bern and Lausanne with a special research and teaching grant from the Swiss NSF. He then applied with Nicolas Perrin to share a chair in the Department of Ecology in Lausanne; fol...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2013
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2012.06.015